Interpretations of Association Rules by Granular Computing
نویسندگان
چکیده
This paper presents interpretations for association rules. It first introduces Pawlak’s method, and the corresponding algorithm of finding decision rules (a kind of association rules). It then uses extended random sets to present a new algorithm of finding interesting rules. It proves that the new algorithm is faster than Pawlak’s algorithm. The extended random sets are easily to include more than one criterion for determining interesting rules. They also provide two measures for dealing with uncertainties in association rules.
منابع مشابه
INTERVAL ANALYSIS-BASED HYPERBOX GRANULAR COMPUTING CLASSIFICATION ALGORITHMS
Representation of a granule, relation and operation between two granules are mainly researched in granular computing. Hyperbox granular computing classification algorithms (HBGrC) are proposed based on interval analysis. Firstly, a granule is represented as the hyperbox which is the Cartesian product of $N$ intervals for classification in the $N$-dimensional space. Secondly, the relation betwee...
متن کاملGranular association rules on two universes with four measures
Relational association rules reveal patterns hidden in multiple tables. Existing rules are usually evaluated through two measures, namely support and confidence. However, these two measures may not be enough to describe the strength of a rule. In this paper, we introduce granular association rules with four measures to reveal connections between granules in two universes, and propose three algo...
متن کاملSpecial Issue on Granular Knowledge Discovery
Granular Computing becomes increasingly popular in modeling of intelligent systems. Granulation of information is inherent in human thinking and reasoning processes. Granular Computing provides an information processing framework where interactive computation and operations are performed on information granules, and is based on the realization that precision is sometimes expensive and/or not mu...
متن کاملOn Modeling Data Mining with Granular Computing
The main objective of this paper is to advocate for formal and mathematical modeling of data mining, which unfortunately has not received much attention. A framework is proposed for rule mining based on granular computing. It is developed in the Tarski’s style through the notions of a model and satisfiability. The model is a database consisting of a finite set of objects described by a finite s...
متن کاملInterpreting Low and High Order Rules: A Granular Computing Approach
The main objective of this paper is to provide a granular computing based interpretation of rules representing two levels of knowledge. This is done by adopting and adapting the decision logic language for granular computing. The language provides a formal method for describing and interpreting conditions in rules as granules and rules as relationships between granules. An information table is ...
متن کامل